Profile trees for Büchi word automata, with application to determinization
نویسندگان
چکیده
منابع مشابه
Profile Trees for Büchi Word Automata, with Application to Determinization
The determinization of Büchi automata is a celebrated problem, with applications in synthesis, probabilistic verification, and multi-agent systems. Since the 1960s, there has been a steady progress of constructions: by McNaughton, Safra, Piterman, Schewe, and others. Despite the proliferation of solutions, they are all essentially ad-hoc constructions, with little theory behind them other than ...
متن کاملObservations on Determinization of Büchi Automata
The two determinization procedures of Safra and MullerSchupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.
متن کامل3 Determinization of Büchi -
To determinize Büchi automata it is necessary to switch to another class of ω-automata, e.g. Muller or Rabin automata. The reason is that there exist languages which are accepted by some nondeterministic Büchi-automaton, but not by any deterministic Büchi-automaton (c.f. section 3.1). The history of constructions for determinizing Büchi automata is long: it starts in 1963 with a faulty construc...
متن کاملA Modular Approach for Büchi Determinization
The problem of Büchi determinization is a fundamental problem with important applications in reactive synthesis, multi-agent systems and probabilistic verification. The first asymptotically optimal Büchi determinization (a.k.a the Safra construction), was published in 1988. While asymptotically optimal, the Safra construction is notorious for its technical complexity and opaqueness in terms of ...
متن کاملA Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
In this paper we establish a lower bound hist(n) for the problem of translating a Büchi word automaton of size n into a deterministic Rabin word automaton when both the Büchi and the Rabin condition label transitions rather than states. This lower bound exactly matches the known upper bound to this problem. The function hist(n) is in Ω((1.64n)) and in o((1.65n)). Our result entails a lower boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2015
ISSN: 0890-5401
DOI: 10.1016/j.ic.2014.12.021